Fuzzy matching for partial XML merge
نویسنده
چکیده
In this paper we describe our experience in creating a tool capable to provide traceability of the requirements between different versions of the LSB and POSIX standards. We propose an approach for merging requirement markup without exact matching of the documents by means of arithmetic hashing and context similarity analysis.
منابع مشابه
An Object-Oriented Approach of Keyword Querying over Fuzzy XML
As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA) semantics is one of the most widely accepte...
متن کاملTask Parallelism for TwigStack Algorithm on a Multi-core System
Abstract The advancement of multi-core processor technology has changed the course of computing and enabled us to maximize the computing performance. In this study, we present an approach of task parallelism for the TwigStack algorithm on a multi-core system to find all occurrences of an XML query twig pattern in a large XML database. The TwigStack agorithm comprises two tasks. The first task i...
متن کاملStructural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and finding all occurrences of these relationships in an XML database is a core operation for XML query processing. In this paper, we develop two families of structural jo...
متن کاملStructural Joins: a Primitive for Eecient Xml Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some speciied tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and nding all occurrences of these structural relationships in an XML database is a core operation for XML query processing. In this paper, we develop two families of struc...
متن کاملApply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کامل